public class HushBuck2<K,V> {

    static class Node<K,V>{
        public K key;
        public V val;
        public Node<K,V> next;

        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }

    public Node<K,V>[]array=(Node<K, V>[]) new Node[10];
    public int usedSize;

    public static final double DEFAULT_LOAD_FACTOR =0.75f;

    public void push(K key,V val){

        int hascode=key.hashCode();

        int index=hascode % array.length;

        Node<K,V> cur=array[index];
        while (cur!=null){
            if (cur.key.equals(key)){
                cur.val=val;
            }
            cur=cur.next;
        }

        Node<K,V> node=new Node<>(key, val);
        node.next=array[index];
        array[index]=node;
        usedSize++;

        if (doloadFactor()>=DEFAULT_LOAD_FACTOR){
            resize();
        }
    }
    private double doloadFactor(){
        return usedSize*1.0/array.length;
    }

    private void resize(){

        Node<K,V>[] newArray=(Node<K, V>[]) new Node[2*array.length];
        for (int i = 0; i < array.length; i++) {
            Node<K,V> cur=array[i];
            while (cur!=null){
                int hashcode=cur.key.hashCode();

                int newIndex=hashcode % newArray.length;

                Node<K,V> curN=cur.next;

                cur.next=newArray[newIndex];
                newArray[newIndex]=cur;

                cur=curN;
            }
        }
        array=newArray;
    }

    public V getVal(K key){
        int hashCode=key.hashCode();
        int index = hashCode % array.length;

        Node<K,V> cur=array[index];

        while (cur!=null){
            if (cur.key.equals(key)){
                return cur.val;
            }
            cur=cur.next;
        }

        return null;
    }
}
